Optimal two-sensor scheduling under duty cycle constraint
نویسندگان
چکیده
We consider periodic sensor scheduling in this paper. A system is observed by two sensors. The two sensors communicate their datawith a remote state estimator via a bandwidth-limited networkwhich allows only one sensor to send its data at each time. We derive the optimal duty cycle pair and a corresponding sensor data schedule to minimize the trace of the average estimation error covariance. Simulations are provided to demonstrate the results. © 2013 Elsevier B.V. All rights reserved.
منابع مشابه
A JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملEnergy-Delay Region of Low Duty Cycle Wireless Sensor Networks for Critical Data Collection
We investigate the trade-off between energy consumption and delay for critical data collection in low duty cycle wireless sensor networks, where a causality constraint exists for routing and link scheduling. We characterize the energy-delay region (E-D region) and formulate a combinatorial optimization problem to determine the link scheduling with the causality constraint. A new multiple-degree...
متن کاملDuty cycle allocation to maximize network lifetime of wireless sensor networks with delay constraints
In wireless sensor networks, the routing control overhead could be large because multiple relays are involved in the routing operation. In order to mitigate this problem, a promising solution is to use tier-based anycast protocols. The main shortcoming of these protocols is that they can consume a much greater amount of energy as compared with other competing protocols using deterministic routi...
متن کاملTowards energy-fairness for broadcast scheduling with minimum delay in low-duty-cycle sensor networks
Broadcast scheduling for low-duty-cycle wireless sensor networks (WSNs) has been extensively studied recently. However, existing solutions mainly focused on optimizing delay and (or) total energy consumption without considering load distribution among nodes. Due to limited energy supply for sensor nodes, heavily loaded sensors often run out of energy quickly, reducing the lifetime of the whole ...
متن کاملApproximation Algorithms for Power-Aware Scheduling of Wireless Sensor Networks with Rate and Duty-Cycle Constraints
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Since traditional optimization methods using Lagrange multipliers do not work well and are computationally expensive given the non-convex constraints, we develop fully polynomial approximation schemes (FPAS) for finding o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Systems & Control Letters
دوره 62 شماره
صفحات -
تاریخ انتشار 2013